Influence Maximization Over Markovian Graphs: A Stochastic Optimization Approach
نویسندگان
چکیده
منابع مشابه
Influence Maximization over Markovian Graphs: A Stochastic Optimization Approach
This paper considers the problem of randomized influence maximization over a Markovian graph process: given a fixed set of nodes whose connectivity graph is evolving as a Markov chain, estimate the probability distribution (over this fixed set of nodes) that samples a node which will initiate the largest information cascade (in expectation). Further, it is assumed that the sampling process affe...
متن کاملFast Influence Maximization in Dynamic Graphs: A Local Updating Approach
We propose a generalized framework for influence maximization in large-scale, time evolving networks. Many real-life influence graphs such as social networks, telephone networks, and IP traffic data exhibit dynamic characteristics, e.g., the underlying structure and communication patterns evolve with time. Correspondingly, we develop a dynamic framework for the influence maximization problem, w...
متن کاملStochastic Dynamic Programming Heuristics for Influence Maximization-Revenue Optimization
The well-known Influence Maximization (IM) problem has been actively studied by researchers over the past decade, with emphasis on marketing and social networks. Existing research have obtained solutions to the IM problem by obtaining the influence spread and utilizing the property of submodularity. This paper is based on a novel approach to the IM problem geared towards optimizing clicks and c...
متن کاملA Mechanism Design Approach for Influence Maximization
With the proliferation of online social networks (OSNs), the characterization of diffusion processes and influence maximization over such processes is a problem of relevance and importance. Although several algorithmic frameworks for identifying influential nodes exist in literature, there is a paucity of literature in the setting of competitive influence. In this paper, we present a novel mech...
متن کاملDiversity Maximization Approach for Multiobjective Optimization
One of the most common approaches for multiobjective optimization is to generate the whole or partial efficient frontier and then decide about the preferred solution in a higher-level decision-making process. In this paper, a new method for generating the efficient frontier for multiobjective problems is developed, called the diversity maximization approach (DMA). This approach is capable of so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal and Information Processing over Networks
سال: 2019
ISSN: 2373-776X,2373-7778
DOI: 10.1109/tsipn.2018.2832011